An Efficient Global Algorithm for Single-Group Multicast Beamforming
نویسندگان
چکیده
منابع مشابه
An Efficient Delay Sensitive Multicast Routing Algorithm
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and tens of heuristics have been developed to solve this NP-complete problem. Among all the previously proposed algorithms, the bounded shortest path algorithm (BSMA) [15] have proved to be capable of producing a multicast t...
متن کاملMirror-Prox SCA Algorithm for Multicast Beamforming and Antenna Selection
This paper considers the (NP-)hard problem of joint multicast beamforming and antenna selection. Prior work has focused on using Semi-Definite relaxation (SDR) techniques in an attempt to obtain a high quality sub-optimal solution. However, SDR suffers from the drawback of having high computational complexity, as SDR lifts the problem to higher dimensional space, effectively squaring the number...
متن کاملAn Efficient Distributed Routing Algorithm for Delay Constrained Multicast
For dynamic QoS multicast routing, efficient handling of node’s join and leave is an important problem. This paper addresses the problem of optimally connecting a new node to an existing multicast tree under sourceto-destination delay and inter-destination delay variation constraints (MRDC-JOIN). We assume a QoS framework where a delay dependent cost function is associated with each network lin...
متن کاملAn Efficient Path-Based Multicast Algorithm for Mesh Networks
This paper presents a new multicast path-based algorithm, referred to here as the Qualified Groups (QG for short), which can achieve a high degree of parallelism and low communication latency over a wide range of traffic loads in the mesh. The QG algorithm relies on a new approach that divides the destinations in a way that balances the traffic load on network channels during the propagation of...
متن کاملAN EFFICIENT PRESENTATION FOR THE GROUP SL (2,121)
In this paper we give a 2-generator 2-relation presentation for the group SL(2,121). This proves that SL(2,121), the covering group of PSL(2,121), is efficient
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2017
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2017.2699640